MAT之GA:遗传算法(GA)解决M-TSP多旅行商问题
导读
MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA). Finds a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations)
目录
输出结果
![](https://img-blog.csdn.net/20180517084303367?watermark/2/text/aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQxMTg1ODY4/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70)
实现代码
% MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
% Finds a (near) optimal solution to t